Defect theorems with compatibility re- lations
نویسندگان
چکیده
We consider words together with a compatibility relation induced by a relation on letters. Unique factorization with respect to two arbitrary word relations R and S defines the (R, S)-freeness of the semigroup considered. We generalize the stability theorem of Schützenberger and Tilson’s closure result for (R, S)free semigroups. The inner and the outer (R, S)-unique factorization hull and the (R, S)-free hull of a set of words are introduced and we show how they can be computed. We prove that the (R, S)-unique factorization hulls possess a defect effect, which implies a variant of a cumulative defect theorem of word semigroups. In addition, a defect theorem of partial words is proved as a corollary.
منابع مشابه
Prototyping Relational Speci cations Using Higher Order Objects
An approach is described for the generation of certain math ematical objects like sets correspondences mappings in terms of re lations using relation algebraic descriptions of higher order objects From non constructive characterizations executable relational speci cations are obtained We also show how to develop more e cient algorithms from the frequently ine cient speci cations within the calc...
متن کاملSome fixed point theorems for weakly subsequentially continuous and compatible of type (E) mappings with an application
In this paper, we will establish some xed point results for two pairs of self mappings satisfying generalized contractive condition by using a new concept as weak subsequential continuity with compatibility of type (E) in metric spaces, as an application the existence of unique common solution for a system of functional equations arising in system programming is proved.
متن کاملPreservation theorems in {L}ukasiewicz \model theory
We present some model theoretic results for {L}ukasiewiczpredicate logic by using the methods of continuous model theorydeveloped by Chang and Keisler.We prove compactness theorem with respect to the class of allstructures taking values in the {L}ukasiewicz $texttt{BL}$-algebra.We also prove some appropriate preservation theorems concerning universal and inductive theories.Finally, Skolemizatio...
متن کاملSpeci cation of a Program Derivation Editor
In this paper a tool for structuring and manipulating formal program derivations is speci ed using the Z notation A program derivation style based on transitive re lations between programs as found in the re nement calculus is assumed The structuring and manipulation of derivations is based on the notion of re nement diagrams proposed by Back This allows for a style of derivation that is much m...
متن کاملCOMON FIXED POINT THEOREMS FOR GENERALIZED WEAKLY CONTRACTIVE MAPPINGS UNDER THE WEAKER MEIR-KEELER TYPE FUNCTION
n this paper, we prove some common fixed point theorems for multivalued mappings and we present some new generalization contractive conditions under the condition of weak compatibility. Our results extends Chang-Chen’s results as well as ´Ciri´c results. An example is given to support the usability of our results.
متن کامل